package binary_search;

public class findPeakElement {
    public int findPeakElement(int[] nums) {

        int left = 0;
        int right = nums.length-1;
        int mid = 0;
        while(left < right) {
            mid = left+ (right - left)/2;
            if(nums[mid] > nums[mid+1]) {
                right = mid;
            }else if(nums[mid] < nums[mid+1]) {
                left = mid +1;
            }
        }
        return right;

    }
}
